Candidate Selection in On-Line Chinese Character Recognition System Using Voting Scheme

نویسندگان

  • Chien-Cheng Tseng
  • Bor-Shenn Jeng
  • Kuo-Sen Chou
چکیده

In this paper, a candidate selection method using a voting scheme is proposed for speeding up a on-line Chinese character recognition system. Three steps in this method are described as follows: First, several simple features are extracted from the input ink data, such as peripheral code. Then, the number of votes which denote the coarse matching scores between input features and 5401 reference features of Chinese characters are computed. Finally, the templates of Chinese characters whose votes are higher than a prescribed threshold are selected to perform detailed matching. Some experimental results show that the proposed selection method is a suitable tool for speeding up a character recognition system under the condition of maintaining the recognition rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of Regular Handwritten Chinese Characters via Grid-based Clustering and Progressive Matching in DCT Domain

This paper presents a two-stage classification approach to recognize handwritten Chinese characters. In contrast to most of the traditional Chinese character recognition systems, which use features in spatial domain as primary selection parameters, we employ DCT technology on the basis of its energy properties in two stages. First, the grid-based clustering scheme is executed to reduce the enti...

متن کامل

Recognition-based handwritten Chinese character segmentation using a probabilistic Viterbi algorithm

This paper presents a recognition-based character segmentation method for handwritten Chinese characters. Possible non-linear segmentation paths are initially located using a probabilistic Viterbi algorithm. Candidate segmentation paths are determined by verifying overlapping paths, between-character gaps, and adjacent-path distances. A segmentation graph is then constructed using candidate pat...

متن کامل

Character confidence based on N-best list for keyword spotting in online Chinese handwritten documents

In keyword spotting from handwritten documents by text query, the word similarity is usually computed by combining character similarities, which are desired to approximate the logarithm of the character probabilities. In this paper, we propose to directly estimate the posterior probability (also called confidence) of candidate characters based on the N-best paths from the candidate segmentation...

متن کامل

Off-Line Handwritten Chinese Character Stroke Extraction

Stroke extraction is of great significance for an offline character recognition system. In this paper, we present an efficient stroke extraction method based on a combination of a simple feature point detection scheme and a novel stroke segment connecting method. The algorithm can fast and accurately extract the strokes from the thinned Chinese character images. Experimental results on a large ...

متن کامل

A two phases approach for discriminating efficient candidate by using DEA inspired procedure

There are several methods to ranking DMUs in Data Envelopment Analysis (DEA) and candidates in voting system. This paper proposes a new two phases method based on DEA’s concepts. The first phase presents an aspiration rank for each candidate and second phase propose final ranking.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1999